Splitting of Expanded Tridiagonal Matrices

نویسنده

  • Seongjai Kim
چکیده

The article addresses a regular splitting of tridiagonal matrices. The given tridiagonal matrix A is rst expanded to an equivalent matrix e A and then split as e A = B R for which B is block-diagonal and every eigenvalue of B R is zero, i.e., (M N) = 0. The optimal splitting technique is applicable to various algorithms that incorporate one-dimensional solves or their approximations. Examples can be found in the parallelization of alternating direction iterative (ADI) methods and e cient parameter choices for domain decomposition (DD) methods for elliptic and parabolic problems. Numerical results solving the Helmholtz wave equation in two dimensions are presented to demonstrate usefulness and e ciency of the splitting technique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

Implementation of the Orthogonal QD Algorithm for Lower Tridiagonal Matrices

The orthogonal qd algorithm with shifts (oqds algorithm), proposed by von Matt, is an algorithm for computing the singular values of bidiagonal matrices. This algorithm is accurate in terms of relative error, and it is also applicable to general triangular matrices. In particular, for lower tridiagonal matrices, BLAS Level 2.5 routines are available in preprocessing stage for this algorithm. BL...

متن کامل

Determinants of Block Tridiagonal Matrices

A tridiagonal matrix with entries given by square matrices is a block tridiagonal matrix; the matrix is banded if off-diagonal blocks are upper or lower triangular. Such matrices are of great importance in numerical analysis and physics, and to obtain general properties is of great utility. The blocks of the inverse matrix of a block tridiagonal matrix can be factored in terms of two sets of ma...

متن کامل

Eigendecomposition of Block Tridiagonal Matrices

Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large matrix sizes. In this paper, we address the problem of the eigendecomposition of block tridiagonal matrices by studying a connection between their eigenvalues and...

متن کامل

Tridiagonal matrices related to subsequences of balancing and Lucas-balancing numbers

It is well known that balancing and Lucas-balancing numbers are expressed as determinants of suitable tridiagonal matrices. The aim of this paper is to express certain subsequences of balancing and Lucas-balancing numbers in terms of determinants of tridiagonal matrices. Using these tridiagonal matrices, a factorization of the balancing numbers is also derived.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000